hard approxim algorithm ddivers exist solut privaci preserv public classifi theoret heurist categori guarante provabl low inform loss incur gigant loss worst case shown empir perform real input numer heurist algorithm develop satisfi advanc privaci principl divers close theoret categori limit anonym earliest principl sever vulner privaci attack motiv present theoret studi divers popular principl wide adopt literatur show optim divers gener np hard distinct sensit valu microdata approxim algorithm develop dimension underli dataset algorithm trivial bound inform loss extens experi real dataset valid effect effici propos solut differenti privaci wavelet transform correl hide independ mask gblender blend visual queri formul queri process graph databas transpar anonym thwart adversari algorithm supersed nearest neighbor search uncertain spatial databas paper propos problem call supersed nearest neighbor search uncertain spatial databas object multidimension probabl densiti function queri point object nearest neighbor nn candid probabl nn nn candid supersed closer object supersed nearest neighbor snn supersed nn candid object supersed nn candid case return snncore minimum set nn candid supersed nn candid snn core intuit snn core object object snn core wors object snn core show snn core effici comput util convent multidimension index confirm extens experi embellish text search queri protect user privaci user text search engin increasingli wari activ disclos confidenti inform busi person profil desir search engin perform document retriev user protect intent paper identifi privaci risk aris semant relat search term queri recur highspecif queri term search session counter risk propos solut similar text retriev system offer anonym plausibl deniabl queri term user intent degrad system precis recal perform solut compris mechan embellish user queri decoi term exhibit similar specif spread genuin term point plausibl altern topic provid accompani retriev scheme enabl search engin comput encrypt document relev score genuin search term remain oblivi distinct decoi empir evalu result present substanti effect solut privaci preserv publish multipl quasi didentifi interact anonym sensit data recent work algorithm limit disclosur data publish algorithm put comprehens usabl toolkit practicion demonstr cat cornel anonym toolkit design interact anonym cat interfac easi guid user process prepar dataset public limit disclosur identif record high risk attack model interact anonym sensit data recent work algorithm limit disclosur data publish algorithm put comprehens usabl toolkit practicion demonstr cat cornel anonym toolkit design interact anonym cat interfac easi guid user process prepar dataset public limit disclosur identif record high risk attack model privaci search log differenti privaci wavelet transform hard approxim algorithm ddivers exist solut privaci preserv public classifi theoret heurist categori guarante provabl low inform loss incur gigant loss worst case shown empir perform real input numer heurist algorithm develop satisfi advanc privaci principl divers close theoret categori limit anonym earliest principl sever vulner privaci attack motiv present theoret studi divers popular principl wide adopt literatur show optim divers gener np hard distinct sensit valu microdata approxim algorithm develop dimension underli dataset algorithm trivial bound inform loss extens experi real dataset valid effect effici propos solut angel enhanc util gener privaci preserv public gener method privaci preserv data public vast popular drawback heavi inform loss difficulti support margin public overcom drawback develop angel anonym techniqu effect gener privaci protect retain significantli inform microdata angel applic monoton principl divers close superior correl preserv obviou tight privaci control enforc show angel lend elegantli hard problem margin public unlik gener releas restrict margin techniqu easili publish margin strong privaci guarante optim random perturb multipl privaci level random perturb popular method comput anonym data privaci preserv data mine simpl appli ensur strong privaci protect permit effect mine larg varieti data pattern exist studi good privaci guarante focu perturb singl privaci level fix degre privaci protect impos anonym data releas data holder drawback limit applic random perturb scenario holder numer recipi privaci level appli motiv studi problem multi level perturb object releas multipl version dataset anonym privaci level challeng recipi collud share data infer privaci permit level solut overcom obstacl achiev crucial properti collus useless mean collud recipi learn trustabl recipi collud recipi data recipi receiv regard analyz output convent uniform perturb solid theoret foundat propos techniqu space econom computation effici requir expect space produc anonym version logm expect time cardin origin dataset number version releas previous bound optim realist assumpt anti dcorrupt privaci preserv public abstract paper deal type privaci threat call corrupt anonym data public specif adversari corrupt individu obtain sensit valu consult releas inform convent gener lead sever privaci disclosur presenc corrupt motiv advoc altern anonym techniqu integr gener perturb stratifi sampl integr strong privaci guarante adversari corrupt number individu verifi effect propos techniqu experi real data anti dcorrupt privaci preserv public abstract paper deal type privaci threat call corrupt anonym data public specif adversari corrupt individu obtain sensit valu consult releas inform convent gener lead sever privaci disclosur presenc corrupt motiv advoc altern anonym techniqu integr gener perturb stratifi sampl integr strong privaci guarante adversari corrupt number individu verifi effect propos techniqu experi real data preserv proxim privaci publish numer sensit data output perturb queri relax primal dual promis faster spatiotempor search exist predict spatiotempor index classifi categori depend base primal dual methodolog gain consider empir knowledg access method limit understand theoret characterist methodolog fact experiment result paper contradict rel superior primal dual techniqu paper present care studi queri perform gener primal dual index reveal import insight behavior techniqu mathemat establish condit determin superior methodolog provid rigor justif observ properli explain literatur analyt find resolv contradict experi previou work vldb journal effici tempor count bound error paper studi aggreg search transact time databas specif object databas model horizont segment project search kei project repres period kei valid histori queri timestamp qt kei rang qk count queri retriev number object aliv qt kei fall qk provid method accur answer queri error naliv qt naliv qt number object aliv time qt constant denot disk page size techniqu requir space process queri logb time support updat logb amort os demonstr extens experi propos solut guarante queri result extrem high precis median rel error consum fraction space occupi exist approach promis precis result vldb journal dinvari privaci preserv dpublic dynam dataset effici spatial match mail address rang search multidimension uncertain data uncertain databas object probabl densiti function describ likelihood appear posit multidimension workspac articl studi type rang retriev fundament analyt task specif nonfuzzi queri return object search region rq probabl tq hand uncertain object fuzzi search retriev set object distanc probabl tq core methodolog concept probabilist constrain rectangl permit effect prune valid nonqualifi qualifi data develop index structur call tree minim queri overhead algorithm find accompani theoret analysi reveal valuabl insight problem characterist mathemat confirm effici solut verifi effect propos techniqu extens effici skylin top dk retriev subspac skylin top queri popular oper prefer retriev practic applic requir oper provid numer candid attribut depend interest user issu queri subset dimens exist algorithm inadequ subspac skylin top search defect requir scan entir databas ii optim subspac incur signific overhead subspac iii demand expens mainten cost space consumpt paper propos techniqu subski settl type queri pure relat technolog core subski transform convert multidimension data valu valu index simpl tree answer subspac queri access fraction databas subski entail low mainten overhead equal cost updat tradit tree extens experi real data confirm techniqu outperform altern solut significantli effici scalabl multidimension revers nn search multi dimension point revers nearest neighbor rknn queri retriev data point nearest neighbor exist method process queri defici support arbitrari valu ii deal effici databas updat iii applic data higher dimension iv retriev approxim result motiv shortcom develop algorithm exact rknn process arbitrari valu dynam multi dimension dataset method util convent data partit index dataset requir pre comput step extend propos techniqu continu rknn search return rknn result point line segment evalu effect algorithm extens experi real synthet dataset subski effici comput skylin subspac set multi dimension point skylin point prefer function monoton ax practic applic requir skylin analysi provid numer candid attribut user depend interest issu queri small subset dimens formal relat larg number gt attribut queri aim find skylin arbitrari subspac low dimension exist algorithm support subspac skylin retriev effici requir scan entir databas ii optim subspac incur signific overhead subspac paper propos techniqu subski settl problem singl tree implement relat databas core sky transform convert multi dimension data valu enabl effect prune heurist extens experi real data confirm subski outperform altern approach significantli effici scalabl mine distanc dbase outlier larg databas metric space set object object outlier exist object distanc valu distanc metric provid user run time object return outlier smallest cost paper consid gener version problem inform outlier comput object mutual distanc prove upper bound memori consumpt permit discoveri outlier scan dataset time upper bound turn extrem low practic actual memori capac realist dbm typic larger develop algorithm integr theoret find carefullydesign heurist leverag addit memori improv effici techniqu report outlier scan dataset case significantli outperform exist solut factor order magnitud person privaci preserv studi gener preserv privaci public sensit data exist method focu univers approach exert amount preserv person cater concret consequ offer insuffici protect subset peopl appli excess privaci control subset motiv present gener framework base concept person anonym techniqu perform minimum gener satisfi requir retain largest amount inform microdata carri care theoret studi lead valuabl insight behavior altern solut analysi mathemat reveal circumst previou work fail protect privaci establish superior propos solut theoret find verifi extens experi anatomi simpl effect privaci preserv index multi ddimension uncertain data arbitrari probabl densiti function uncertain databas object multi dimension probabl densiti function pdf describ likelihood appear posit data space fundament oper probabilist rang search pq rectangular area rq retriev object rq probabl pq paper propos tree access method design optim cpu time rang retriev multi dimension imprecis data structur fulli dynam object increment insert delet order place constraint data pdf verifi queri updat effici tree extens experi detail dpreserv approach impuls nois remov imag detail dpreserv approach impuls nois remov imag 